On traces of literary-philosophical traces in Mahammad Hadi’s romanticism
نویسندگان
چکیده
منابع مشابه
On Codings of Traces
The paper solves the main open problem of [BFG94]. We show that given two dependence alphabets (Σ, D) and (Σ′, D′), it is decidable whether there exists a strong coding h : M(Σ, D) −→ M(Σ′, D′) between the associated trace monoids. In fact, we show that the problem is NP-complete. (A coding is an injective homomorphism, it is strong if independent letters are mapped to independent traces.) We e...
متن کاملTraces and Quasi-traces on the Boutet De Monvel Algebra
We construct an analogue of Kontsevich and Vishik’s canonical trace for a class of pseudodifferential boundary value problems in Boutet de Monvel’s calculus on compact manifolds with boundary. For an operator A in the calculus (of class zero), and an auxiliary operator B, formed of the Dirichlet realization of a strongly elliptic second-order differential operator and an elliptic operator on th...
متن کاملTraces on Irregular Ideals
Simple answers are given to the following and related questions: For what Hubert space operator A is it true that the smallest ideal (alternatively, the smallest norm ideal, the smallest maximal norm ideal) containing A is a norm (an intermediate norm, a principal norm) ideal? Do these ideals support a nontrivial unitary invariant positive linear functional?
متن کاملOn Clustering Simulation Traces
Discrete event simulation is widely used in performance and dependability analysis of systems, often in a way that many replica of a model are simulated. Those replica may reveal substantially different dynamic behavior of the simulation model. Recognizing if this is the case and what different classes of behavior are present can be of relevance to gain more insight in the system under study bu...
متن کاملOn Matching Concurrent Traces
Concurrent traces are sequences of computational steps where independent steps can be permuted and executed in any order. We study the problem of matching on concurrent traces. We give a sound and complete algorithm for matching traces with one variable standing for an unknown subtrace. 1 State-Transition Concurrency Computation in a concurrent system results from the interactions of computing ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Azerbaijan Journal of Educational Studies
سال: 2020
ISSN: 0134-3289
DOI: 10.29228/edu.235